COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	plan.abs[w86,jmc]	Abstract for Planlunch talk
C00005 ENDMK
C⊗;
plan.abs[w86,jmc]	Abstract for Planlunch talk

title: Situation calculus planning in blocks and related worlds

Abstract: This talk is mainly ideas rather than completed work.
Situation calculus is based on the equation  s' = result(e,s),
where  s  and  s'  are situations and  e  is an event.  Provided
one can control the deduction adequately, this is a more powerful
formalism than STRIPS.  Planning a sequence of actions, or more
generally, a strategy of actions to achieve as situation with
specified properties admits a variety of heuristics which in
whittle away at the problem.  In many practical situations, these
heuristics, which don't guarantee an full solution but leave a
reduced problem, are sufficient.  Humans appear to use many of them
and so should computer programs.  The talk therefore will concern both
epistemological and heuristic aspects of planning problems.

temporal logic, times and sets of times
co-operating domain specialists
how much reification is needed
contexts?
Waldinger's paper
mental situations

goofs:
	I should have pointed out some of the context tradeoff possibilities.
John's umbrella is on the table.
John McCarthy's umbrella is on the table on 1986 Mar 10 1159.
The blue umbrella belonging to John McCarthy (Prof. of Computer Science,
Stanford University, U.S.A. in 1986) is on the table near the door
in the conference room at SRI International where the Planning Seminar
was held on 1986 Mar 10 1159.
More details would be needed in a yet more general context.